Skew-morphisms of nonabelian characteristically simple groups
نویسندگان
چکیده
A skew-morphism of a finite group G is permutation σ on fixing the identity element such that product 〈 〉 with left regular representation forms . This called skew-product The was introduced as an algebraic tool to investigate Cayley maps. In this paper, we characterize skew-products skew-morphisms nonabelian characteristically simple groups (see Theorem 1.2 ) and corresponding maps 1.6 ).
منابع مشابه
C-Characteristically Simple Groups
Let G be a group and let Autc(G) be the group of central automorphisms of G. We say that a subgroup H of a group G is c-characteristic if α(H) = H for all α ∈ Autc(G). We say that a group G is c-characteristically simple group if it has no non-trivial c-characteristic subgroup. If every subgroup of G is c-characteristic then G is called co-Dedekindian group. In this paper we characterize c-char...
متن کاملClassification of coset-preserving skew-morphisms of finite cyclic groups
The concept of a coset-preserving skew-morphism is a generalization of the widely studied t-balanced skew-morphisms of regular Cayley maps which are in turn generalizations of group automorphisms. In case of abelian groups, all skew-morphisms of regular Cayley maps are roots of coset-preserving skew-morphisms, and therefore, classification of cosetpreserving skew-morphisms of finite abelian gro...
متن کاملPentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups
Let Γ be a graph and let G be a group of automorphisms of Γ. The graph Γ is called G-normal if G is normal in the automorphism group of Γ. Let T be a finite non-abelian simple group and let G = T l with l ≥ 1. In this paper we prove that if every connected pentavalent symmetric T -vertex-transitive graph is T -normal, then every connected pentavalent symmetric G-vertex-transitive graph is G-nor...
متن کاملCLASSIFYING FUZZY SUBGROUPS OF FINITE NONABELIAN GROUPS
In this paper a rst step in classifying the fuzzy subgroups of a nite nonabelian group is made. We develop a general method to count the number of distinct fuzzy subgroups of such groups. Explicit formulas are obtained in the particular case of dihedral groups.
متن کاملA classification of nonabelian simple 3-BCI-groups
For a finite group G and a subset S ⊆ G (possibly, S contains the identity of G), the bi-Cayley graph BCay(G, S) of G with respect to S is the graph with vertex set G × {0, 1} and with edge set {(x, 0), (sx, 1)|x ∈ G, s ∈ S}. A bi-Cayley graph BCay(G, S) is called a BCI-graph if, for any bi-Cayley graph BCay(G, T ), whenever BCay(G, S) ∼= BCay(G, T ) we have T = gS , for some g ∈ G, α ∈ Aut(G)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2022
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2021.105539